On multi-processor speed scaling with migration
نویسندگان
چکیده
منابع مشابه
Speed Scaling on Parallel Processors with Migration
We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (or works), on parallel speed-scaled processors so as to minimize the total energy consumption. We consider that both preemption and migration of jobs are allowed. An exact polynomial-time algorithm has been proposed for this problem, which is based on the Ellipsoid algorithm. Here, we for...
متن کاملBrief Announcement: Operational Analysis of Processor Speed Scaling
This brief announcement presents a pair of performance laws that bound the change in aggregate job queueing time that results when the processor speed changes in a parallel computing system. Our laws require only lightweight passive external observations of a black-box system and they apply to many commonly employed scheduling policies. By predicting the application-level performance impact of ...
متن کاملPopulation-level scaling of avian migration speed with body size and migration distance for powered fliers.
Optimal migration theory suggests specific scaling relationships between body size and migration speed for individual birds based on the minimization of time, energy, and risk. Here we test if the quantitative predictions originating from this theory can be detected when migration decisions are integrated across individuals. We estimated population-level migration trajectories and daily migrati...
متن کاملSpeed-Scaling with No Preemptions
We revisit the non-preemptive speed-scaling problem, in which a set of jobs have to be executed on a single or a set of parallel speed-scalable processor(s) between their release dates and deadlines so that the energy consumption to be minimized. We adopt the speedscaling mechanism first introduced in [Yao et al., FOCS 1995] according to which the power dissipated is a convex function of the pr...
متن کاملScheduling on a Single Processor with Variable Speed
Alidaee and Ahmadian considered a single machine scheduling problem with varying processing times, and presented a polynomial algorithm that minimizes the sum of absolute deviations of jobs’ completion times from a common due date. In this short note we remark that it is possible to eliminate one of the algorithm steps, therefore obtaining a more efficient procedure. We also show that the appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2015
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2015.03.001